Three Different Algorithms for Generating Uniformly Distributed Random Points on the N-Sphere

نویسنده

  • Jan Poland
چکیده

We present and compare three different approaches to generate random points on the N -sphere: A simple Monte Carlo algorithm, a coordinate-by-coordinate strategy and a method based on the rotation invariance the normal distribution. The latter algorithm is the fastest.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytically exact spiral scheme for generating uniformly distributed points on the unit sphere

The problem of constructing a set of uniformly-distributed points on the surface of a sphere, also known as the Thomson problem, has a long and interesting history, which dates back to J.J. Thomson in 1904. A particular variant of the Thomson problem that is of great importance to biomedical imaging is that of generating a nearly uniform distribution of points on the sphere via a deterministic ...

متن کامل

Spatial statistics for lattice points on the sphere I‎: ‎Individual results

‎We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares‎. ‎We examine several statistics of these point sets‎, ‎such as the electrostatic potential‎, ‎Ripley's function‎, ‎the variance of the number of points in random spherical caps‎, ‎and the covering radius‎. ‎Some of the results are conditional on t...

متن کامل

On the variance of the random sphere of influence graph

We show that the variance of the number of edges in the random sphere of innuence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R d , grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of innuence graph built on a Poisson number of sites. Some related proximity graphs are discussed as w...

متن کامل

Random Triangles III

Let Ω be a compact convex set in Euclidean n-space with nonempty interior. Random triangles are defined here by selecting three independent uniformly distributed points in Ω to be vertices. Generating such points for (n,Ω) = (2,unit square) or (n,Ω) = (3,unit cube) is straightforward. For (n,Ω) = (2,unit disk) or (n,Ω) = (3,unit ball), we use the following result [1]. Let X1, X2, X3, Y1, Y2, Y3...

متن کامل

Investigation of pore-scale random porous media using lattice boltzmann method

The permeability and tortuosity of pore-scale two and three-dimensional random porous media were calculated using the Lattice Boltzmann method (LBM). Effects of geometrical parameters of medium on permeability and tortuosity were investigated as well. Two major models of random porous media were reconstructed by computerized tomography method: Randomly distributed rectangular obstacles in a uni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000